A better subgraph of the minimum weight triangulationBO-TING YANG.Information processing letters. 1995, Vol 56, Num 5, pp 255-258, issn 0020-0190Article

Construction of optimal ternary constant weight codes via Bhaskar Rao designsGE, Gennian.Discrete mathematics. 2008, Vol 308, Num 13, pp 2704-2708, issn 0012-365X, 5 p.Article

Tight lower bounds for minimum weight triangulation heuristicsLEVCOPOULOS, C; KRZNARIC, D.Information processing letters. 1996, Vol 57, Num 3, pp 129-135, issn 0020-0190Article

A new type of edge-derived vertex coloringGYORI, Ervin; PALMER, Cory.Discrete mathematics. 2009, Vol 309, Num 22, pp 6344-6352, issn 0012-365X, 9 p.Conference Paper

Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weightFERENCOVA, Barbora; MADARAS, Tomáš.Discrete mathematics. 2010, Vol 310, Num 12, pp 1661-1675, issn 0012-365X, 15 p.Article

2-Change for k-connected networksGOEMANS, M. X; TALLURI, K. T.Operations research letters. 1991, Vol 10, Num 2, pp 113-117, issn 0167-6377Article

PRACTICAL APPLICATION OF A SAMPLING INVARIANT FOR DETERMINING THE MINIMUM WEIGH OF A SAMPLE FOR ASSAYINGGOROKHOD I YU.1982; FIZ.-TEH. PROBL. RAZRAB. POLEZN. ISKOP.; ISSN 0015-3273; SUN; DA. 1982; NO 4; PP. 101-110; BIBL. 3 REF.Article

A lower bound for approximating the geometric minimum weight matchingDAS, G; SMID, M.Information processing letters. 2000, Vol 74, Num 5-6, pp 253-255, issn 0020-0190Article

Fault-tolerant routing: k-inconnected many-to-one routing in wireless networksDEYING LI; YUEXUAN WANG; QINGHUA ZHU et al.Theoretical computer science. 2011, Vol 412, Num 3, pp 209-216, issn 0304-3975, 8 p.Article

ESTIMATING THE WEIGHT OF METRIC MINIMUM SPANNING TREES IN SUBLINEAR TIMECZUMAJ, Artur; SOHLER, Christian.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 904-922, issn 0097-5397, 19 p.Article

A 5 + ∈-approximation algorithm for minimum weighted dominating set in unit disk graphDECHENG DAI; CHANGYUAN YU.Theoretical computer science. 2009, Vol 410, Num 8-10, pp 756-765, issn 0304-3975, 10 p.Article

Efficient computation of 2-medians in a tree network with positive/negative weightsBENKOCZI, Robert; BHATTACHARYA, B. K; BRETON, D et al.Discrete mathematics. 2006, Vol 306, Num 14, pp 1505-1516, issn 0012-365X, 12 p.Conference Paper

Approximating the minimum weight weak vertex covertYONG ZHANG; QI GE; FLEISCHE, Rudolf et al.Theoretical computer science. 2006, Vol 363, Num 1, pp 99-105, issn 0304-3975, 7 p.Article

A factor 2 approximation algorithm for the vertex cover P₃ problemJIANHUA TU; WENLI ZHOU.Information processing letters. 2011, Vol 111, Num 14, pp 683-686, issn 0020-0190, 4 p.Article

An application of the Turán theorem to domination in graphsSHAN, Erfang; CHENG, T. C. E; LIYING KANG et al.Discrete applied mathematics. 2008, Vol 156, Num 14, pp 2712-2718, issn 0166-218X, 7 p.Article

Upper minus total domination in small-degree regular graphsHONG YAN; XIAOQI YANG; ERFANG SHAN et al.Discrete mathematics. 2007, Vol 307, Num 21, pp 2453-2463, issn 0012-365X, 11 p.Article

The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customersYUKUN CHENG; LIYING KANG; CHANGHONG LU et al.Theoretical computer science. 2010, Vol 411, Num 7-9, pp 1038-1044, issn 0304-3975, 7 p.Article

APPROXIMATING STEINER NETWORKS WITH NODE-WEIGHTSNUTOV, Zeev.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3001-3022, issn 0097-5397, 22 p.Article

Edge searching weighted graphsYASAR, Öznur; DYER, Danny; PIKE, David A et al.Discrete applied mathematics. 2009, Vol 157, Num 8, pp 1913-1923, issn 0166-218X, 11 p.Article

Minimum Lee weights of Type II codes over F₂rBETSUMIYA, Koichi.Discrete mathematics. 2008, Vol 308, Num 14, pp 3018-3022, issn 0012-365X, 5 p.Conference Paper

A modified greedy algorithm for dispersively weighted 3-set coverFUJITO, Toshihiro; OKUMURA, Tsuyoshi.Discrete applied mathematics. 2006, Vol 154, Num 9, pp 1392-1400, issn 0166-218X, 9 p.Conference Paper

Finding and enumerating Hamilton cycles in 4-regular graphsGEBAUER, Heidi.Theoretical computer science. 2011, Vol 412, Num 35, pp 4579-4591, issn 0304-3975, 13 p.Article

A MIN-MAX THEOREM ON TOURNAMENTSXUJIN CHEN; XIAODONG HU; WENAN ZANG et al.SIAM journal on computing (Print). 2008, Vol 37, Num 3, pp 923-937, issn 0097-5397, 15 p.Article

Remarks on the minus (signed) total domination in graphsSHAN, Erfang; CHENG, T. C. E.Discrete mathematics. 2008, Vol 308, Num 15, pp 3373-3380, issn 0012-365X, 8 p.Article

A method to find cosets of the first-order Reed-Muller code with a high minimum weightFONTAINE, C.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 464Conference Paper